Constrained percolation in two dimensions

Constrained Percolation in Two Dimensions

We prove absence of infinite clusters and contours in a class of critical constrained percolation models on the square lattice. The percolation configuration is assumed to satisfy certain hard local constraints, but only weak symmetry and ergodicity conditions are imposed on its law. The proofs use new combinatorial techniques exploiting

Oriented Percolation in Two Dimensions

Universality for Bond Percolation in Two Dimensions

All (in)homogeneous bond percolation models on the square, triangular, and hexagonal lattices belong to the same universality class, in the sense that they have identical critical exponents at the critical point (assuming the exponents exist). This is proved using the star–triangle transformation and the box-crossing property. The exponents in question are the one-arm exponent ρ, the 2j-alterna...

Near-critical percolation in two dimensions

We give a self-contained and detailed presentation of Kesten’s results that allow to relate critical and near-critical percolation on the triangular lattice. They constitute an important step in the derivation of the exponents describing the near-critical behavior of this model. For future use and reference, we also show how these results can be obtained in more general situations, and we state...

Generic rigidity percolation in two dimensions.

We study rigidity percolation for random central-force networks on the bondand site-diluted generic triangular lattice. Here, each site location is randomly displaced from the perfect lattice, removing any special symmetries. Using the pebble game algorithm, the total number of floppy modes are counted exactly, and exhibit a cusp singularity in the second derivative at the transition from a rig...